Sufficiency and duality in nondifferentiable multiobjective programming involving higher order strong invexity
نویسندگان
چکیده
منابع مشابه
Second - Order Duality for Nondifferentiable Multiobjective Programming Involving ( , Ρ ) - Univexity
The concepts of ( , ρ)-invexity have been given by Carsiti,Ferrara and Stefanescu[32]. We consider a second-order dual model associated to a multiobjective programming problem involving support functions and a weak duality result is established under appropriate second-order ( , ρ)-univexity conditions. AMS 2002 Subject Classification: 90C29, 90C30, 90C46.
متن کاملSymmetric duality for a higher-order nondifferentiable multiobjective programming problem
*Correspondence: [email protected] 1Department of Mathematics, Indian Institute of Technology, Roorkee, 247 667, India Full list of author information is available at the end of the article Abstract In this paper, a pair of Wolfe type higher-order nondifferentiable symmetric dual programs over arbitrary cones has been studied and then well-suited duality relations have been established consider...
متن کاملOn Nondifferentiable Higher-Order Symmetric Duality in Multiobjective Programming Involving Cones
In this paper, we point out some deficiencies in a recent paper (Lee and Kim in J. Nonlinear Convex Anal. 13:599–614, 2012), and we establish strong duality and converse duality theorems for two types of nondifferentiable higher-order symmetric duals multiobjective programming involving cones.
متن کاملNondifferentiable multiobjective programming under generalized dI-invexity
In this paper, we are concerned with a nondifferentiable multiobjective programming problem with inequality constraints. We introduce four new classes of generalized convex functions by combining the concepts of weak strictly pseudoinvex, strong pseudoinvex, weak quasi invex, weak pseudoinvex and strong quasi invex functions in Aghezzaf and Hachimi [Numer. Funct. Anal. Optim. 22 (2001) 775], d-...
متن کاملEfficiency and Duality in Nondifferentiable Multiobjective Programming Involving Directional Derivative
In this paper, we introduce a new class of generalized dI-univexity in which each component of the objective and constraint functions is directionally differentiable in its own direction di for a nondifferentiable multiobjective programming problem. Based upon these generalized functions, sufficient optimality conditions are established for a feasible point to be efficient and properly efficien...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Inequalities and Applications
سال: 2015
ISSN: 1029-242X
DOI: 10.1186/s13660-015-0819-9